Scheduling with release dates on a single machine to minimize total weighted completion time
نویسندگان
چکیده
منابع مشابه
Single .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملMinimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
In this paper a single machine scheduling problem to minimize tardy jobs is considered. To increase the reality of the problem, deterioration and learning effect is added to. Beside, according to Inherent uncertainty in processing times, they are considered to be normally distributed. To find an appropriate solution, four existing models are extended and the results are compared to validate them.
متن کاملScheduling with Rejection to Minimize the Total Weighted Completion Time∗
In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted completion time with the constraint of total penalties on identical parallel machines, where the number of...
متن کاملA $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
We give a (2 + ǫ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]
متن کاملA 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
We present a √ e/( √ e−1)-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance guarantee can be made arbitrarily close to the Euler constant e [18].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90255-9